Degree distribution and scaling in the Connecting Nearest Neighbors model
نویسندگان
چکیده
We present a detailed analysis of the connecting-nearest-neighbors model by Vázquez [Phys. Rev. E 67, 056104 (2003)]. We show that the degree distribution follows a power law, but the scaling exponent can vary with the parameter setting. Moreover, the correspondence of the growing version of the connecting-nearest-neighbors model to the particular random walk model and recursive search model is established.
منابع مشابه
Scaling in Counter Expressed Gene Networks Constructed from Gene Expression Data
We study counter expressed gene networks constructed from gene-expression data obtained from many types of cancers. The networks are synthesized by connecting vertices belonging to each others’ list of K-farthest-neighbors, with K being an a priori selected non-negative integer. In the range of K corresponding to minimum homogeneity, the degree distribution of the networks shows scaling. Cluste...
متن کاملA comparative study of performance of K-nearest neighbors and support vector machines for classification of groundwater
The aim of this work is to examine the feasibilities of the support vector machines (SVMs) and K-nearest neighbor (K-NN) classifier methods for the classification of an aquifer in the Khuzestan Province, Iran. For this purpose, 17 groundwater quality variables including EC, TDS, turbidity, pH, total hardness, Ca, Mg, total alkalinity, sulfate, nitrate, nitrite, fluoride, phosphate, Fe, Mn, Cu, ...
متن کاملA Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors
Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...
متن کاملEstimation of Density using Plotless Density Estimator Criteria in Arasbaran Forest
Sampling methods have a theoretical basis and should be operational in different forests; therefore selecting an appropriate sampling method is effective for accurate estimation of forest characteristics. The purpose of this study was to estimate the stand density (number per hectare) in Arasbaran forest using a variety of the plotless density estimators of the nearest neighbors sampling me...
متن کاملMetric recovery from directed unweighted graphs
We analyze directed, unweighted graphs obtained from xi ∈ R by connecting vertex i to j iff |xi − xj | < ε(xi). Examples of such graphs include k-nearest neighbor graphs, where ε(xi) varies from point to point, and, arguably, many real-world graphs such as copurchasing graphs. We ask whether we can recover the underlying Euclidean metric ε(xi) and the associated density p(xi) given only the dir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 85 2 Pt 2 شماره
صفحات -
تاریخ انتشار 2012